Ordinal notions of submodularity
نویسندگان
چکیده
We consider several ordinal formulations of submodularity, defined for arbitrary binary relations on lattices. Two of these formulations are essentially due to David Kreps (A Representation Theorem for “Preference for Flexibility”, Econometrica, 1979) and one is a weakening of a notion due to Paul Milgrom and Chris Shannon (Monotone Comparative Statics, Econometrica, 1994). We show that any reflexive binary relation satisfying either of Kreps’s definitions also satisfies Milgrom and Shannon’s definition, and that any transitive and monotonic binary relation satisfying the Milgrom and Shannon condition satisfies both of Kreps’s conditions.
منابع مشابه
FUZZY NEXUS OVER AN ORDINAL
In this paper, we define fuzzy subnexuses over a nexus $N$. Define and study the notions of the prime fuzzy subnexuses and the fractionsinduced by them. Finally, we show that if S is a meetclosed subset of the set Fsub(N), of fuzzy subnexuses of a nexus N, andh= ⋀S ϵ S, then the fractions S^-1 N and h^-1 N are isomorphic as meet-semilattices.
متن کاملSecond-order Characterizable Cardinals and Ordinals Second-order Characterizable Cardinals and Ordinals
The notions of finite and infinite second-order characterizability of cardinal and ordinal numbers are developed. Several known results for the case of finite characterizability are extended to infinite characterizability, and investigations of the secondorder theory of ordinals lead to some observations about the Fraenkel-Carnap question for well-orders and about the relationship between ordin...
متن کاملSubmodularity Helps in Nash and Nonsymmetric Bargaining
Motivated by recent insights on the two solution concepts of Nash and nonsymmetric bargaining games, obtained from an algorithmic study of these notions [Vaz09], we take a fresh look at understanding their quality and robustness by subjecting them to several “stress tests”. Our tests are quite basic, e.g., we ask whether the solutions delivered are efficient, fair, respond in a desirable manner...
متن کاملGuarantees for Greedy Maximization of Non-submodular Functions with Applications
A. Organization of the Appendix Appendix B presents the proofs for our approximation guarantees and its tightness for the GREEDY algorithm. Appendix C provides details on existing notions of curvature and submodularity ratio, and relates it to the notions in this paper. Appendix D presents detailed proofs for bounding the submodularity ratio and curvature for various applications. Appendix E gi...
متن کاملThe Ordinal Numbers
In the beginning of article we show some consequences of the regularity axiom. In the second part we introduce the successor of a set and the notions of transitivity and connectedness wrt membership relation. Then we define ordinal numbers as transitive and connected sets, and we prove some theorems of them and of their sets. Lastly we introduce the concept of a transfinite sequence and we show...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007